首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1099篇
  免费   495篇
  国内免费   81篇
  2024年   3篇
  2023年   19篇
  2022年   14篇
  2021年   28篇
  2020年   39篇
  2019年   27篇
  2018年   13篇
  2017年   91篇
  2016年   90篇
  2015年   76篇
  2014年   101篇
  2013年   103篇
  2012年   97篇
  2011年   83篇
  2010年   61篇
  2009年   110篇
  2008年   73篇
  2007年   77篇
  2006年   84篇
  2005年   65篇
  2004年   73篇
  2003年   46篇
  2002年   51篇
  2001年   41篇
  2000年   31篇
  1999年   28篇
  1998年   25篇
  1997年   21篇
  1996年   23篇
  1995年   11篇
  1994年   14篇
  1993年   13篇
  1992年   9篇
  1991年   7篇
  1990年   15篇
  1989年   9篇
  1988年   2篇
  1987年   2篇
排序方式: 共有1675条查询结果,搜索用时 15 毫秒
61.
本文介绍了武昌造船厂在企业质量文化中,继承和拓展优良传统,牢固树立"100 1"的质量理念,采取特色管理活动,结合生产经营管理实际,把质量文化理念与生产经营深度融合,在企业管理中落地生根,促进质量管理水平不断提高和产品实物质量的持续提升。  相似文献   
62.
雷达信号特征提取是雷达信号识别中的重要组成部分,直接影响到识别效果的好坏。在研究直方图算法分析雷达信号特征的基础上,提出2种改进的直方图算法:截断直方图算法和窄带直方图算法,并用仿真实验分析影响算法性能的4个因素,验证了直方图算法提取雷达信号参数特征的有效性。  相似文献   
63.
遗传算法在防空导弹火力优化分配中的应用   总被引:2,自引:0,他引:2  
介绍了遗传算法的基本原理、算法设计并结合遗传算法主要解决了如何把目标分配给火力单元的问题,编写了相应的程序,并给出了一个基于遗传算法的火力优化分配方案。  相似文献   
64.
两点源诱偏系统是应用有源干扰的方式,利用反辐射导弹(ARM)本身的缺陷来对反辐射导弹的导引头进行干扰,从而达到保护主战雷达目的的一种有源干扰系统。主要从反辐射导弹的基本原理和有源诱偏的概念入手,对两点源诱偏系统进行理论推导、数学建模、布站设想,后引入毁伤概率指标对各种布站方式进行分类、仿真,对每一种仿真结果进行分析、评估,再把各种分析结果加以比较,从中找出最佳的布站方式。最后利用以上的分析结果,得出几点有用的结论。  相似文献   
65.
把英语作为第二语言的教学是20世纪60年代在美国兴起并逐步走向独立的科目,它在综合相关专业的同时正在朝专业化方向发展。近年来其硕士层面的教育为全球培养了大量合格的中小学英语教师,取得了较好的成绩。本文以曼卡托明尼苏达州立大学英语系为例,并结合笔者在该系攻读TESL硕士学位时的经历,解析其主要课程及设置理据。  相似文献   
66.
针对球约束凸二次规划问题,利用Lagrange对偶将其转化为无约束优化问题,然后运用单纯形法对其求解,获得原问题的最优解。最后,对文中给出的算法给出了论证。  相似文献   
67.
In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.  相似文献   
68.
We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
69.
We study a component inventory planning problem in an assemble‐to‐order environment faced by many contract manufacturers in which both quick delivery and efficient management of component inventory are crucial for the manufacturers to achieve profitability in a highly competitive market. Extending a recent study in a similar problem setting by the same authors, we analyze an optimization model for determining the optimal component stocking decision for a contract manufacturer facing an uncertain future demand, where product price depends on the delivery times. In contrast to our earlier work, this paper considers the situation where the contract manufacturer needs to deliver the full order quantity in one single shipment. This delivery requirement is appropriate for many industries, such as the garment and toy industries, where the economies of scale in transportation is essential. We develop efficient solution procedures for solving this optimization problem. We use our model results to illustrate how the different model parameters affect the optimal solution. We also compare the results under this full‐shipment model with those from our earlier work that allows for multiple partial shipments. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
70.
We introduce and develop models for a physical goods storage system based on the 15‐puzzle, a classic children's game in which 15 numbered tiles slide within a 4 × 4 grid. The objective of the game is to arrange the tiles in numerical sequence, starting from a random arrangement. For our purposes, the tiles represent totes, pallets, or even containers that must be stored very densely, and the objective is to maneuver items to an input–output point for retrieval or processing. We develop analytical results for storage configurations having a single empty location (as in the game) and experimental results for configurations with multiple empty locations. Designs with many empty locations can be made to form aisles, allowing us to compare puzzle‐based designs with traditional aisle‐based designs found in warehousing systems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号